Wilfried Imrich
نویسنده
چکیده
Let M(m; n) be the complexity of checking whether a graph G with m edges and n vertices is a median graph. We show that the complexity of checking whether G is triangle-free is at most M(m; m). Conversely, we prove that the complexity of checking whether a given graph is a median graph is at most O(m log n)+T(m log n; n), where T(m; n) is the complexity of nding all triangles of the graph. This implies that it is unlikely that the complexity O(m p n) of the fastest known algorithm for recognizing median graphs can be improved. We also demonstrate that, intuitively speaking, there are as many median graphs as there are triangle-free graphs. Finally, these results enable us to prove that the complexity of recognizing planar median graphs is linear.
منابع مشابه
Recognizing Cartesian products in linear time
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammeer, Hagauer, and Imrich [2], who compute the prime factors in O(m log n) time, where m denotes the number of vertices of G and n the number of edges. Our algorithm is conceptually simpler. It gains its efficiency by the...
متن کاملMultiple Kronecker covering graphs
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be unique.
متن کاملA prime factor theorem for a generalized direct product
We introduce the concept of neighborhood systems as a generalization of directed, reflexive graphs and show that the prime factorization of neighborhood systems with respect to the the direct product is unique under the condition that they satisfy an appropriate notion of thinness.
متن کاملCancellation properties of products of graphs
This note extends results of Fernández, Leighton, and López-Presa on the uniqueness of r roots for disconnected graphs with respect to the Cartesian product to other products and shows that their methods also imply new cancelation laws.
متن کامل